A Relative Positioning Technique with Spatial Constraints for Multiple Targets Based on Sparse Wireless Sensor Network

نویسندگان

  • Weiming XU
  • Xiaodong YIN
  • Zhuzi HE
  • Tianyang LIU
چکیده

Many applications of wireless sensor network require precise knowledge of the locations of nodes. Conventional sparse wireless sensor network, which is formed by a restricted number of nodes, has two drawbacks, i.e., low connective ratio and hop count limited, which probably cause the network link failure and/or low locating performance. To improve the relative position precision and reliability of multiple targets based on the sparse wireless sensor network, a relative locating method with spatial constraints is proposed according to the different network configuration and inter-range between target nodes for the sparse wireless sensor network, of which the spatial constraint benchmarks include two categories of datum, namely, the spatial absolute displacement datum and direction rotation datum. In particular, it is proven on the basis of the principle of survey adjustment that the nodes’ position ambiguity, which is caused by the rank deficiency, could be solved while the estimating precision of the target nodes position is unchanged. The simulation results show that compared to the conventional time-varying filtering, e.g. Kalman Filtering, the proposed constraint position method may rapidly respond to network-link communication failure, and increase relative positioning precision about 32.9 % via introducing the spatial constraint benchmarks. Copyright © 2013 IFSA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization

A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...

متن کامل

3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks

Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...

متن کامل

A Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks

Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...

متن کامل

A multi-hop PSO based localization algorithm for wireless sensor networks

A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...

متن کامل

STCS-GAF: Spatio-Temporal Compressive Sensing in Wireless Sensor Networks- A GAF-Based Approach

Routing and data aggregation are two important techniques for reducing communication cost of wireless sensor networks (WSNs). To minimize communication cost, routing methods can be merged with data aggregation techniques. Compressive sensing (CS) is one of the effective techniques for aggregating network data, which can reduce the cost of communication by reducing the amount of routed data to t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013